Averages of norms and quasi - norms ∗
نویسندگان
چکیده
We compute the number of summands in q-averages of norms needed to approximate an Euclidean norm. It turns out that these numbers depend on the norm involved essentially only through the maximal ratio of the norm and the Euclidean norm. Particular attention is given to the case q = ∞ (in which the average is replaced with the maxima). This is closely connected with the behavior of certain families of projective caps on the sphere.
منابع مشابه
Robust blind methods using $\ell_p$ quasi norms
It was shown in a previous work that some blind methods can be made robust to channel order overmodeling by using the l1 or lp quasi-norms. However, no theoretical argument has been provided to support this statement. In this work, we study the robustness of subspace blind based methods using l1 or lp quasi-norms. For the l1 norm, we provide the sufficient and necessary condition that the chann...
متن کاملCorrespondence between probabilistic norms and fuzzy norms
In this paper, the connection between Menger probabilistic norms and H"{o}hle probabilistic norms is discussed. In addition, the correspondence between probabilistic norms and Wu-Fang fuzzy (semi-) norms is established. It is shown that a probabilistic norm (with triangular norm $min$) can generate a Wu-Fang fuzzy semi-norm and conversely, a Wu-Fang fuzzy norm can generate a probabilistic norm.
متن کاملKakeya-nikodym Averages and L-norms of Eigenfunctions
We provide a necessary and sufficient condition that Lp-norms, 2 < p < 6, of eigenfunctions of the square root of minus the Laplacian on 2-dimensional compact boundaryless Riemannian manifolds M are small compared to a natural power of the eigenvalue λ. The condition that ensures this is that their L2 norms over O(λ−1/2) neighborhoods of arbitrary unit geodesics are small when λ is large (which...
متن کاملUnified Scalable Equivalent Formulations for Schatten Quasi-Norms
The Schatten quasi-norm can be used to bridge the gap between the nuclear norm and rank function. However, most existing algorithms are too slow or even impractical for large-scale problems, due to the singular value decomposition (SVD) or eigenvalue decomposition (EVD) of the whole matrix in each iteration. In this paper, we rigorously prove that for any 0< p≤ 1, p1, p2 > 0 satisfying 1/p= 1/p...
متن کاملNorms of Translating Taboo Words and Concepts from English into Persian after the Islamic Revolution in Iran
The research attempted to discover the norms of translating taboo words and concepts after the Islamic Revolution in Iran using Toury’s (1995) framework for classification of norms. The corpus of the study composed of Coelho’s novels between 1990 and 2005 and their Persian translations which were prepared and analyzed manually to discover the norms. During both the selection of novels for trans...
متن کامل